منابع مشابه
The generic approximation lemma
The approximation lemma is a simplification of the well-known take lemma, and is used to prove properties of programs that produce lists of values. We show how the approximation lemma, unlike the take lemma, can naturally be generalised from lists to a large class of datatypes, and present a generic approximation lemma that is parametric in the datatype to which it applies. As a useful by-produ...
متن کاملA Sparse Regular Approximation Lemma
We introduce a new variant of Szemerédi’s regularity lemma which we call the sparse regular approximation lemma (SRAL). The input to this lemma is a graph G of edge density p and parameters , δ, where we think of δ as a constant. The goal is to construct an -regular partition of G while having the freedom to add/remove up to δ|E(G)| edges. As we show here, this weaker variant of the regularity ...
متن کاملThe quadratic approximation lemma and decompositions of superlative indexes
It was shown in 1976 that a difference in a quadratic function of N variables evaluated at two points is exactly equal to the sum of the arithmetic average of the first order partial derivatives of the function evaluated at the two points times the differences in the independent variables. In the present paper, this result is generalized and the resulting generalized quadratic approximation lem...
متن کاملPredictive Shape Coding Using Generic Polygon Approximation
We introduce an e cient predictive binary shape coding method that consists of (1) global motion estimation, (2) local motion estimation, (3) matched segment coding, and (4) residual segment coding. Global and local motion estimation use contour pel matching and knowledge of previously reconstructed contours. After motion compensation, we code the one-dimensional reference contour indices of th...
متن کاملAn Approximation Lemma about the Cut Locus, with Applications in Optimal Transport Theory
A path in a Riemannian manifold can be approximated by a path meeting only finitely many times the cut locus of a given point. The proof of this property uses recent works of Itoh–Tanaka and Li–Nirenberg about the differential structure of the cut locus. We present applications in the regularity theory of optimal transport.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2001
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(00)00220-9